基于柠檬酸-铕纳米配位聚合物构建荧光探针快速检测汤煲中5’-肌苷酸含量

基于柠檬酸-铕金属有机纳米配体聚合物（citrate/europium lanthanide coordination polymer nanoparticles，Cit/Eu LCP NPs）构建快速检测肉品汤煲中5’-肌苷酸（inosine-5’-monophosphate，5’-IMP）的荧光探针。研究结果表明，5’-IMP对Cit/Eu?LCP?NPs有良好的荧光猝灭作用。在最佳条件下，该荧光探针在5’-IMP?2.5～200?μg/mL的质量浓度范围内呈现出良好的线性关系，检出限为0.17?μg/mL，且具备良好的抗干扰、稳定性和重复性。为了验证方法可行性，将该方法应用于实际鸡汤样品中的5’-IMP检测，测得加标回收率为97.85%～103.95%，可为快速检测肉品汤煲中5’-IMP提供新的思路和方法。     

Effect of 100 KeV Ar+ ion beam irradiation on ZnO thin films – Influence of morphology vis-a-vis electrode/electrolyte interface and its impact on photoelectrochemical water splitting

The present study attempts quantitative determination of changes in the morphological surface features viz. fractal dimension, lower and upper cut off length scale through Power Spectral Density analysis prior to and after irradiation of 100 KeV Ar⁺ ion beam at incidence angles of 0°, 40° and 60° on ZnO thin films. All the unirradiated and irradiated samples are subjected to photoelectrochemical characterization and a correlation between photoelectrochemical performance and morphological parameters is established. Sample irradiated at 40° angle at the fluence of 5 × 10¹⁶ ions/cm² is found to possess maximum fractal dimension of 2.72, lower and upper cut off length scale of 3.16 nm and 63.00 nm respectively. This sample exhibits maximum photocurrent density of 3.19 mA/cm² and applied bias photon-to-current efficiency of 1.12% at 1.23 V/RHE. Hydrogen gas collected for duration of 1 h for the same sample was ~4.83 mLcm^?2.     

一种5 重real-time PCR筛查转基因水稻方法的建立

以转基因水稻中最常用的CaMV35S启动子、NOS终止子、Cry1Ab/Ac基因、HPT基因及SPS水稻内标基因为研究对象，利用5 种不同的荧光信号（FAM、HEX、Taxas Red、Cy5、Cy5.5）进行多重实时聚合酶链式反应（real-time polymerase chain reaction，real-time PCR）检测方法的研究。通过引物组合筛选、反应体系优化、特异性测试、灵敏度测试、适用性测试等一系列实验，建立了5 重real-time PCR方法，灵敏度可达0.032%。此方法具有灵敏度高、结果准确、通量大等优点，可实现水稻中转基因成分的快速、高效检测。     

Copy Move Forgery Detection based on double matching

Copy Move is a technique widespreadly used in digital image tampering, meaning Copy Move Forgery Detection (CMFD) is still a significant research. In this paper, a novel CMFD method is proposed, including double matching process and region localizing process. In double matching process, the first matching is conducted on Delaunay triangles consisting of Local Intensity Order Pattern (LIOP) keypoints, to find the approximate location of suspicious regions. In order to find sufficient keypoint pairs, the existing set of matching triangles is expanded by adding their neighbors iteratively, covering the whole tampered regions, and the second matching with a looser threshold is conducted on the vertices. In the region localizing process, considering the case of multiple copies, Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is used to classify the keypoint pairs described in a new model. Experimental results indicate that the proposed method, with good robustness, outperforms some state-of-the-art methods.     

混凝土结构的压电声波检测分析

本文介绍了混凝土结构的压电体波和表面波检测的主要进展,对两种压电声波检测的优缺点进行了总结。体波检测设备一般埋入混凝土内部,需要选择合理的检测部位,检测结果较为精确;声表面波检测无需选择特定的部位,但是检测深度有限。在实际检测工作过程中,可以联合两种方法相互验证。     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

Note on nonparametric spectral analysis of wideband spectrum with missing data via sample-and-hold interpolation and deconvolution

In [1] a procedure for bias-free estimation of the autocorrelation function is introduced for equidistantly sampled data with randomly occurring samples being invalid. The method incorporates sample-and-hold interpolation of the missing data points. The occurring dynamic error of the primary estimate of the correlation function is treated by a deconvolution procedure with two parameters $c_0$ and $c_1$ with $c_0+2c_1=1$, which are the on-diagonal and the aside-diagonal parameters of a specific correction matrix (at all lag times except zero). The parameters $c_0$ and $c_1$ were obtained as a function of the probability α of a sample to be valid by numerical simulation. However, explicit expressions for the parameters $c_0(\alpha )=1-\frac{2}{\alpha }+\frac{2}{{\alpha }^2}$ and $c_1(\alpha )=\frac{1}{\alpha }-\frac{1}{{\alpha }^2}$ can be derived, which might improve the usability of the deconvolution procedure in [1].     

A robust locating multi-optima approach for damage identification of plate-like structures

This paper proposes a robust optimization approach for multiple damage identification of plate-like structures. Different from traditional particle swarm optimizations (PSOs), a combined PSO and niche technique (NPSO) is proposed to solve multimodal optimization problems, with the full consideration of subswarm creation, merging and absorbing mechanism. As a hypersensitive parameter to damage, the curvature mode shape is adopted to construct the objective function. Case studies are conducted to investigate the effectiveness and robustness of the algorithm on multi-damage identification. Simulation results show that the proposed algorithm exhibits robust search performance on identifying damage locations accurately with good convergence behavior. It is hoped that this study can provide guidance on robust damage detection, especially when the structure is subject to multiple damages and external disturbances.     

基于概要数据结构的全网络持续流检测方法

持续流是隐蔽的网络攻击过程中显现的一种重要特征，它不产生大量流量且在较长周期内有规律地发生，给传统的检测方法带来极大挑战。针对网络攻击的隐蔽性、单监测点的重负荷和信息有限的问题，提出全网络持续流检测方法。首先，设计一种概要数据结构，并将其部署在每个监测点；其次，当网络流到达监测点时，提取流的概要信息并更新概要数据结构的一位；然后，在测量周期结束时，主监测点将来自其他监测点的概要信息进行综合；最后，提出流持续性的近似估计，通过一些简单计算为每个流构建一个位向量，利用概率统计方法估计流持续性，使用修正后的持续性估计检测持续流。通过真实的网络流量进行实验，结果表明，与长持续时间流检测算法（TLF）相比，所提方法的准确性提高了50%，误报率和漏报率分别降低了22%和20%，说明全网络持续流检测方法能够有效监测高速网络流量。